Polynomial relations among principal minors of a 4×4-matrix
نویسندگان
چکیده
The image of the principal minor map for n×n-matrices is shown to be closed. In the 19th century, Nansen and Muir studied the implicitization problem of finding all relations among principal minors when n = 4. We complete their partial results by constructing explicit polynomials of degree 12 that scheme-theoretically define this affine variety and also its projective closure in P15. The latter is the main component in the singular locus of the 2×2×2×2-hyperdeterminant.
منابع مشابه
Polynomial relations among principal minors of a 4x4-matrix
The image of the principal minor map for n×n-matrices is shown to be closed. In the 19th century, Nansen and Muir studied the implicitization problem of finding all relations among principal minors when n = 4. We complete their partial results by constructing explicit polynomials of degree 12 that scheme-theoretically define this affine variety and also its projective closure in P15. The latter...
متن کاملRelations among Principal Minors of a Matrix
Relations among Principal Minorsof a Matrix – p. 1/1 Definitions Let A = (a ij) ∈ C n 2 be a complex n × n matrix. A σ ∈ C: principal minor of A indexed by σ, with A ∅ = 1. A * ∈ C 2 n : vector whose entries are the principal minors of A. Definitions Let A = (a ij) ∈ C n 2 be a complex n × n matrix. A σ ∈ C: principal minor of A indexed by σ, with A ∅ = 1. A * ∈ C 2 n : vector whose entries are...
متن کاملPrincipal minors and rhombus tilings
The algebraic relations between the principal minors of an n× n matrix are somewhat mysterious, see e.g. [LS09]. We show, however, that by adding in certain almost principal minors, the relations are generated by a single relation, the so-called hexahedron relation, which is a composition of six cluster mutations. We give in particular a Laurent-polynomial parameterization of the space of n× n ...
متن کاملHyperdeterminantal relations among symmetric principal minors
The principal minors of a symmetric n×n-matrix form a vector of length 2n. We characterize these vectors in terms of algebraic equations derived from the 2×2×2-hyperdeterminant.
متن کاملOn the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models
A heavy traac limit theorem for networks of queues with multiple customer types. 27 We now compute the principal minors of D k 2 and D k 3. First consider D k 2. All the principal minors of order 2 are equal to 1. The principal minor corresponding to f1; 3; 4g is equal to 1 + 3 1 3 4 == 2 , and the remaining principal minors of order 3 are equal to 1. The determinant of the matrix itself is 1 ?...
متن کامل